Improved deterministic parallel integer sorting

Improved Deterministic Parallel Padded Sorting

Given an input array of n real numbers, sorting with padding consists in writing those numbers in order in an array of size (1 +)n, thus leaving n entries empty. Only comparisons are allowed between the numbers to be sorted. We describe an algorithm that, with nk processors in the CRCW PRAM model, sorts the input array with padding o(1) using time O(log k n log (log k n) + loglog k). This impro...

More Efficient Parallel Integer Sorting

We present a more efficient CREW PRAM algorithm for integer sorting. This algorithm sorts n integers in {0, 1, 2, ..., n} in O((log n)/ log log n) time and O(n(log n/ log log n)) operations. It also sorts n integers in {0, 1, 2, ..., n− 1} in O((log n)/ log log n) time and O(n(log n/ log log n) log log log n) operations. Previous best algorithm [13] on both cases has time complexity O(log n) bu...

Improved in-place associative integer sorting

A novel integer sorting technique was proposed replacing bucket sort, distribution counting sort and address calculation sort family of algorithms which requires only constant amount of additional memory. The technique was inspired from one of the ordinal theories of “serial order in behavior” and explained by the analogy with the three main stages in the formation and retrieval of memory in co...

On Parallel Hashing and Integer Sorting

On Parallel Hashing and Integer Sorting

The problem of sorting n integers from a restricted range [1..m], where m is superpolynomial in n, is considered. An o(nlog n) randomized algorithm is given. Our algorithm takes O(n log log m) expected time and 0(n) space. (Thus, for m nv ) we have an 0(n log log n) algorithm.) The algorithm is parallelizable. The resulting parallel algorithm achieves optimal speed up. Some features of the algo...